In Implementation Model for Contexts and Negation in Conceptual Graphs

An implementation model for a retrieval and inference system based on the theory of conceptual graphs is presented. Several hard issues related to the full implementation of the theory are taken up and solutions presented. The solutions attempt to exploit existing but not fully recognized symmetries in CG theory. These symmetries include those between formation and inference rules, AND and OR, positive and negative, copy and restrict, general and speciic, etc. Topics taken up include the implementation of Sowa's formation rules, the storage of a conceptual graph hierarchy involving contexts and negation as a conjunctive normal form (CNF) lattice, the extension of existing retrieval algorithms, such as Levinson's Method III and UDS, to handle complex referents and nested contexts, the checking of consistency, and the deenition of Peirce's inference rules in terms of formation rules. A distinction is made between syntactic implication and semantic implication. The issues tackled in the paper lay the foundation for a full scale graph-based rst-order logic theorem prover.